package algorithm;

public class leetcode_0509 {
    public int fib(int n) {
        return F(n);
    }
    public int F(int n){
        if(n==0) return 0;
        if(n==1||n==2) return 1;
        return F(n-1)+F(n-2);
    }
}
